Instructor : Nikhil Bansal Scribe : Yiqun Chen 1 The general MWU setting

نویسندگان

  • Nikhil Bansal
  • Yiqun Chen
چکیده

We can view the prediction problem considered previously as the following: We have m experts and we maintain a vector pt (probability distribution) over the experts and at each round nature reveals loss `t ∈ {0, 1}n. We incur expected loss pt · `t and therefore cumulative loss ∑T t=1 pt· `t. Moreover, in randomized weighted majority we set wi(t+1) = wi(t)(1− ) if i makes an mistake and we choose expert i with probability pi(t+ 1) = wi(t+1) ( ∑ i′ wi′ (t+1)) . We showed that

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Instructor : Nikhil Bansal Scribe : Seeun

In this lecture, we consider online network design and a new analysis framework based on tree embeddings introduced in [3]. We will start with the most basic online network design problem called the online Steiner tree problem. Then, we review the necessary background on tree embeddings for the analysis framework and apply the framework to analyze a natural greedy algorithm for the online Stein...

متن کامل

Instructor : Nikhil Bansal Scribe : Tim Oosterwijk 1 Independent set problem for bipartite graphs

Last lecture, we started a discussion about the independent set (“stable set”) problem. For a given graph G = (V,E), an independent set is a subset of vertices that are mutually non-adjacent. The independent set problem asks to find the maximum cardinality of such a vertex set. We saw this problem is notoriously NP-hard: it is NP-hard to approximate within a factor n1−ε for any ε > 0. However, ...

متن کامل

Instructor : Nikhil Bansal Scribe :

In this lecture we will be looking into the secretary problem, and an interesting variation of the problem called the incentive comparable secretary problem. For both of these problems we will show how they can be solved though a correspondence between all possible strategies and the feasible solution space to a linear program. In both cases this will allow us to derive an algorithm and prove t...

متن کامل

Lecture 16 : CS 880 : Complexity of Counting Problems

03/15/2012 Lecture 16: CS 880: Complexity of Counting Problems Instructor: Jin-Yi Cai Scribe: Chen Zeng For a symmetric, bipartite matrix A ∈ C, we want to prove the following theorem: Theorem 1. If EVAL(A) is not #P-hard, then there exists an m × m purified bipartite matrix A such that EVAL(A) ≡ EVAL(A). Recall the definition of the purified bipartite matrix : Definition 1. Let A ∈ C be a symm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016